The Viterbi algorithm and Markov noise memory
نویسندگان
چکیده
منابع مشابه
The Viterbi algorithm and Markov noise memory
This work designs sequence detectors for channels with intersymbol interference (ISI) and correlated (and/or signal-dependent) noise. We describe three major contributions. i) First, by modeling the noise as a finite-order Markov process, we derive the optimal maximum-likelihood sequence detector (MLSD) and the optimal maximum a posteriori (MAP) sequence detector, extending to the correlated no...
متن کاملHidden Markov Models and the Viterbi algorithm
is understood to have N hidden Markov states labelled by i (1 ≤ i ≤ N), and M possible observables for each state, labelled by a (1 ≤ a ≤ M). The state transition probabilies are pij = p(qt+1 = j | qt = i), 1 ≤ i, j ≤ N (where qt is the hidden state at time t), the emission probability for the observable a from state i is ei(a) = p(Ot = a | qt = i) (where Ot is the observation at time t), and t...
متن کاملThe Viterbi Algorithm 1 1 The Viterbi Algorithm
This paper is a tutorial introduction to the Viterbi Algorithm, this is reinforced by an example use of the Viterbi Algorithm in the area of error correction in communications channels. Some extensions to the basic algorithm are also discussed briefly. Some of the many application areas where the Viterbi Algorithm has been used are considered, including it's use in communications, target tracki...
متن کاملThe Viterbi Algorithm
This paper is a tutorial introduction to the Viterbi Algorithm, this is reinforced by an example use of the Viterbi Algorithm in the area of error correction in communications channels. Some extensions to the basic algorithm are also discussed briefly. Some of the many application areas where the Viterbi Algorithm has been used are considered, including it's use in communications, target tracki...
متن کاملRobustifying the Viterbi Algorithm
We present an efficient algorithm for estimating hidden state sequences in imprecise hidden Markov models (iHMMs), based on observed output sequences. The main difference with classical HMMs is that the local models of an iHMM are not represented by a single mass function, but rather by a set of mass functions. We consider as estimates for the hidden state sequence those sequences that are maxi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2000
ISSN: 0018-9448
DOI: 10.1109/18.817531